Large Alphabets and Incompressibility
نویسنده
چکیده
We briefly survey some concepts related to empirical entropy — normal numbers, de Bruijn sequences and Markov processes — and investigate how well it approximates Kolmogorov complexity. Our results suggest lth-order empirical entropy stops being a reasonable complexity metric for almost all strings of length m over alphabets of size n about when nl surpasses m.
منابع مشابه
Estimation and Compression Over Large Alphabets
OF THE DISSERTATION Estimation and Compression Over Large Alphabets
متن کاملUsing the incompressibility method to obtain local lemma results for Ramsey-type problems
We reveal a connection between the incompressibility method and the Lovász local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated on the example of van der Waerden numbers. It applies to lower bounds of Ramsey numbers, large transitive subtournaments and other Ramsey phenomena as well.
متن کاملCSA++: Fast Pattern Search for Large Alphabets
Indexed pattern search in text has been studied for many decades. For small alphabets, the FM-Index provides unmatched performance, in terms of both space required and search speed. For large alphabets – for example, when the tokens are words – the situation is more complex, and FM-Index representations are compact, but potentially slow. In this paper we apply recent innovations from the field ...
متن کاملOn Large Alphabet Compression
In this report, we present results in Large Alphabet Compression. We first show that the min-max redundancy of standard compression tends towards infinity for sufficiently large alphabets. With this, we motivate two other approaches that are employed in compressing large alphabets, namely pattern and shape compression. We then present upper and lower bounds on the min-max redundancy of the same.
متن کاملLearning Regular Languages over Large Ordered Alphabets
This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the alphabet. We then extend Angluin’s L∗ algorithm for learning regular languages from examples for such automata. We have implemented this algorithm and we demon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 99 شماره
صفحات -
تاریخ انتشار 2006